Genetic Algorithms for Satellite Scheduling Problems
نویسندگان
چکیده
منابع مشابه
Genetic Algorithms for Job-Shop Scheduling Problems
The n×m minimum-makespan general job-shop scheduling problem, hereafter referred to as the JSSP, can be described by a set of n jobs {Ji}1≤j≤n which is to be processed on a set of m machines {Mr}1≤r≤m. Each job has a technological sequence of machines to be processed. The processing of job Jj on machine Mr is called the operation Ojr. Operation Ojr requires the exclusive use of Mr for an uninte...
متن کاملGenetic Algorithms for Solving Open Shop Scheduling Problems
In this paper we investigate the use of three evolutionary based heuristics to the open shop scheduling problem. The intractability of this problem is a motivation for the pursuit of heuristics that produce approximate solutions. This work introduces three evolutionary based heuristics, namely, a permutation genetic algorithm, a hybrid genetic algorithm and a sellsh gene algorithm, and tests th...
متن کاملAn Overview of Genetic Algorithms for Job Shop Scheduling Problems
This paper reviews modern genetic algorithm based approaches for solving job shop scheduling problems Genetic algorithms represent one of the most popular and mostly used metaheuristic methods applied for solving many optimization problems within last few decades. Job shop scheduling represents one of the hardest combinatorial optimization problems where number of possible schedules drastically...
متن کاملGenetic Algorithms for Solving Scheduling Problems in Flexible Manufacturing Cells
In this paper, scheduling problems in Flexible Manufacturing Cells (FMC) are studied. The scheduling objective is to minimize the makespan. We used a genetic algorithm (GA) for solving the optimization scheduling problem. We have developed one FMC with industrial characteristics with the objective of studying scheduling problems in these types of manufacturing systems (single machine scheduling...
متن کاملGenetic Algorithms for Shop Scheduling Problems: a Survey
Genetic algorithms are a very popular heuristic which have been successfully applied to many optimization problems within the last 30 years. In this chapter, we give a survey on some genetic algorithms for shop scheduling problems. In a shop scheduling problem, a set of jobs has to be processed on a set of machines such that a specific optimization criterion is satisfied. According to the restr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mobile Information Systems
سال: 2012
ISSN: 1574-017X,1875-905X
DOI: 10.1155/2012/717658